Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser
نویسندگان
چکیده
The Algebraic Eraser (AE) is a public key protocol for sharing information over an insecure channel using commutative and noncommutative groups; a concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP). In this paper, we describe how to choose data in CBKAP to thwart an attack by Kalka–Teicher–Tsaban.
منابع مشابه
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser
The Algebraic Eraser Diffie–Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless sensors. It is a group-theoretic cryptographic protocol that allows two users to construct a shared secret via a Diffie–Hellma...
متن کاملCryptanalysis of the Algebraic Eraser and short expressions of permutations as products
On March 2004, Anshel, Anshel, Goldfeld, and Lemieux introduced the Algebraic Eraser scheme for key agreement over an insecure channel. This scheme is based on semidirect products of algebraic structures, and uses a novel hybrid of infinite and finite noncommutative groups. They also introduced the Colored Burau Key Agreement Protocol (CBKAP), a concrete realization of this scheme. We present a...
متن کاملShort expressions of permutations as products and cryptanalysis of the Algebraic Eraser
On March 2004, Anshel, Anshel, Goldfeld, and Lemieux introduced the Algebraic Eraser scheme for key agreement over an insecure channel, using a novel hybrid of infinite and finite noncommutative groups. They also introduced the Colored Burau Key Agreement Protocol (CBKAP), a concrete realization of this scheme. We present general, efficient heuristic algorithms, which extract the shared key out...
متن کاملCryptanalysis via algebraic spans
We introduce a method for obtaining provable polynomial time solutions of problems in nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and more efficient than earlier methods. After demonstrating its applicability to the major classic nonabelian protocols, we use this method to cryptanalyze the Triple Decomposition key exchange protocol, the only classic gro...
متن کاملA Practical Cryptanalysis of the Algebraic Eraser
Anshel, Anshel, Goldfeld and Lemieaux introduced the Colored Burau Key Agreement Protocol (CBKAP) as the concrete instantiation of their Algebraic Eraser scheme. This scheme, based on techniques from permutation groups, matrix groups and braid groups, is designed for lightweight environments such as RFID tags and other IoT applications. It is proposed as an underlying technology for ISO/IEC 291...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1202.0598 شماره
صفحات -
تاریخ انتشار 2012